A Mechanically Veriied Application for a Mechanically Veriied Environment
نویسنده
چکیده
We have developed a veriied application proved to be both eeective and eecient. The application generates moves in the puzzle-game Nim and is coded in Piton, a language with a formal semantics and a compiler veriied to preserve its semantics on the underlying machine. The Piton compiler is targeted to the FM9001, a recently fabricated veriied microprocessor. The Nim program correctness proof makes use of the language semantics that the compiler is proved to implement. Like the Piton compiler proof and FM9001 design proof, the Nim correctness proof is generated using Nqthm, a proof system sometimes known as the Boyer-Moore theorem prover.
منابع مشابه
Formal Veri cation of Pipelined Machines withOut - of - order Execution
This paper discusses the technical details of the design veriication of a pipelined processor with out-of-order execution. We have developed new techniques to verify pipelined processors with complex control logic. Our principal technique is modeling the stream of instructions using a table representation, which allows us to directly express many machine-relevant properties. Using this represen...
متن کاملMechanising some Advanced Refinement Concepts
We describe how proof rules for three advanced reenement features are mechanically veriied using the HOL theorem prover. These features are data reenement, backwards data reenement and superposition reenement of initialised loops. We also show how applications of these proof rules to actual program reenement can be checked using the HOL system, with the HOL system generating the veriication con...
متن کاملCharacterizing speed-independence of high-level designs
This paper characterizes the speed-independence of high-level designs. The characterization is a condition on the design description ensuring that the behavior of the design is independent of the speeds of its components. The behavior of a circuit is modeled as a transition system, that allows data types, and internal as well as external non-determinism. This makes it possible to verify the spe...
متن کاملMechanically Verifying a Family of Multiplier Circuits
A methodology for mechanically verifying a family of pa-rameterized multiplier circuits, including many well-known multiplier circuits such as the linear array, the Wallace tree and the 7-3 multi-plier is proposed. A top level speciication for these multipliers is obtained by abstracting the commonality in their behavior. The behavioral correctness of any multiplier in the family can be mechani...
متن کاملConstruction of Veriied Software Systems with Program-checking: an Application to Compiler Back-ends
This paper describes how program-checking can be used to signiicantly reduce the amount of veriication work to establish the implementation correctness of software systems which may be partly generated by unveriied construction tools. We show the practicability of our approach with an application to the construction of veriied compiler back-ends. The basic idea of program-checking is to use an ...
متن کامل